Lower Bound on the Correlation Between Monotone Families in the Average Case
نویسنده
چکیده
A well-known inequality due to Harris and Kleitman [4, 10] states that any two monotone subsets of {0, 1} are non-negatively correlated with respect to the uniform measure on {0, 1}. In [15], Talagrand established a lower bound on the correlation in terms of how much the two sets depend simultaneously on the same coordinates. In this paper we show that when the correlation is averaged over all the pairs A,B ∈ T for any family T of monotone subsets of {0, 1}, the lower bound asserted in [15] can be improved, and more precise estimates on the average correlation can be given. Furthermore, we generalize our results to the correlation between monotone functions on [0, 1] with respect to the Lebesgue measure.
منابع مشابه
Correlation Bounds Against Monotone NC
This paper gives the first correlation bounds under product distributions (including the uniform distribution) against the class mNC of poly(n)-size O(log n)-depth monotone circuits. Our main theorem, proved using the pathset complexity framework recently introduced in [56], shows that the average-case k-CYCLE problem (on Erdős-Rényi random graphs with an appropriate edge density) is 12 + 1 pol...
متن کاملCorrelation Bounds Against Monotone NC^1
This paper gives the first correlation bounds under product distributions, including the uniform distribution, against the class mNC1 of polynomial-size O(logn)-depth monotone circuits. Our main theorem, proved using the pathset complexity framework introduced in [56], shows that the average-case k-CYCLE problem (on Erdős-Rényi random graphs with an appropriate edge density) is 2 + 1 poly(n) ha...
متن کاملAverage Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملContinuous dependence on coefficients for stochastic evolution equations with multiplicative Levy Noise and monotone nonlinearity
Semilinear stochastic evolution equations with multiplicative L'evy noise are considered. The drift term is assumed to be monotone nonlinear and with linear growth. Unlike other similar works, we do not impose coercivity conditions on coefficients. We establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. As corollaries of ...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009